\documentclass[twoside]{book}

% Packages required by doxygen
\usepackage{fixltx2e}
\usepackage{calc}
\usepackage{doxygen}
\usepackage[export]{adjustbox} % also loads graphicx
\usepackage{graphicx}
\usepackage[utf8]{inputenc}
\usepackage{makeidx}
\usepackage{multicol}
\usepackage{multirow}
\PassOptionsToPackage{warn}{textcomp}
\usepackage{textcomp}
\usepackage[nointegrals]{wasysym}
\usepackage[table]{xcolor}

% Font selection
\usepackage[T1]{fontenc}
\usepackage[scaled=.90]{helvet}
\usepackage{courier}
\usepackage{amssymb}
\usepackage{sectsty}
\renewcommand{\familydefault}{\sfdefault}
\allsectionsfont{%
  \fontseries{bc}\selectfont%
  \color{darkgray}%
}
\renewcommand{\DoxyLabelFont}{%
  \fontseries{bc}\selectfont%
  \color{darkgray}%
}
\newcommand{\+}{\discretionary{\mbox{\scriptsize$\hookleftarrow$}}{}{}}

% Page & text layout
\usepackage{geometry}
\geometry{%
  a4paper,%
  top=2.5cm,%
  bottom=2.5cm,%
  left=2.5cm,%
  right=2.5cm%
}
\tolerance=750
\hfuzz=15pt
\hbadness=750
\setlength{\emergencystretch}{15pt}
\setlength{\parindent}{0cm}
\setlength{\parskip}{0.2cm}
\makeatletter
\renewcommand{\paragraph}{%
  \@startsection{paragraph}{4}{0ex}{-1.0ex}{1.0ex}{%
    \normalfont\normalsize\bfseries\SS@parafont%
  }%
}
\renewcommand{\subparagraph}{%
  \@startsection{subparagraph}{5}{0ex}{-1.0ex}{1.0ex}{%
    \normalfont\normalsize\bfseries\SS@subparafont%
  }%
}
\makeatother

% Headers & footers
\usepackage{fancyhdr}
\pagestyle{fancyplain}
\fancyhead[LE]{\fancyplain{}{\bfseries\thepage}}
\fancyhead[CE]{\fancyplain{}{}}
\fancyhead[RE]{\fancyplain{}{\bfseries\leftmark}}
\fancyhead[LO]{\fancyplain{}{\bfseries\rightmark}}
\fancyhead[CO]{\fancyplain{}{}}
\fancyhead[RO]{\fancyplain{}{\bfseries\thepage}}
\fancyfoot[LE]{\fancyplain{}{}}
\fancyfoot[CE]{\fancyplain{}{}}
\fancyfoot[RE]{\fancyplain{}{\bfseries\scriptsize Generated on Sun Apr 17 2016 13\+:34\+:34 for Introduction\+\_\+to\+\_\+\+Algorithms by Doxygen }}
\fancyfoot[LO]{\fancyplain{}{\bfseries\scriptsize Generated on Sun Apr 17 2016 13\+:34\+:34 for Introduction\+\_\+to\+\_\+\+Algorithms by Doxygen }}
\fancyfoot[CO]{\fancyplain{}{}}
\fancyfoot[RO]{\fancyplain{}{}}
\renewcommand{\footrulewidth}{0.4pt}
\renewcommand{\chaptermark}[1]{%
  \markboth{#1}{}%
}
\renewcommand{\sectionmark}[1]{%
  \markright{\thesection\ #1}%
}

% Indices & bibliography
\usepackage{natbib}
\usepackage[titles]{tocloft}
\setcounter{tocdepth}{3}
\setcounter{secnumdepth}{5}
\makeindex

% Hyperlinks (required, but should be loaded last)
\usepackage{ifpdf}
\ifpdf
  \usepackage[pdftex,pagebackref=true]{hyperref}
\else
  \usepackage[ps2pdf,pagebackref=true]{hyperref}
\fi
\hypersetup{%
  colorlinks=true,%
  linkcolor=blue,%
  citecolor=blue,%
  unicode%
}

% Custom commands
\newcommand{\clearemptydoublepage}{%
  \newpage{\pagestyle{empty}\cleardoublepage}%
}


%===== C O N T E N T S =====

\begin{document}

% Titlepage & ToC
\hypersetup{pageanchor=false,
             bookmarks=true,
             bookmarksnumbered=true,
             pdfencoding=unicode
            }
\pagenumbering{roman}
\begin{titlepage}
\vspace*{7cm}
\begin{center}%
{\Large Introduction\+\_\+to\+\_\+\+Algorithms }\\
\vspace*{1cm}
{\large Generated by Doxygen 1.8.10}\\
\vspace*{0.5cm}
{\small Sun Apr 17 2016 13:34:34}\\
\end{center}
\end{titlepage}
\clearemptydoublepage
\tableofcontents
\clearemptydoublepage
\pagenumbering{arabic}
\hypersetup{pageanchor=true}

%--- Begin generated contents ---
\chapter{Namespace Index}
\input{namespaces}
\chapter{Hierarchical Index}
\input{hierarchy}
\chapter{Class Index}
\input{annotated}
\chapter{File Index}
\input{files}
\chapter{Namespace Documentation}
\input{namespaceanonymous__namespace_02adjlistgraph__test_8h_03}
\input{namespaceanonymous__namespace_02bellmanford__test_8h_03}
\input{namespaceanonymous__namespace_02bfs__test_8h_03}
\input{namespaceanonymous__namespace_02connectedcomponent__test_8h_03}
\input{namespaceanonymous__namespace_02dagshortpath__test_8h_03}
\input{namespaceanonymous__namespace_02dfs__test_8h_03}
\input{namespaceanonymous__namespace_02dijkstra__test_8h_03}
\input{namespaceanonymous__namespace_02disjointset__test_8h_03}
\input{namespaceanonymous__namespace_02floyd__warshall__test_8h_03}
\input{namespaceanonymous__namespace_02fordfulkerson__test_8h_03}
\input{namespaceanonymous__namespace_02front__flow__vertex__test_8h_03}
\input{namespaceanonymous__namespace_02genericpushrelabel__test_8h_03}
\input{namespaceanonymous__namespace_02graph__test_8h_03}
\input{namespaceanonymous__namespace_02johnson__test_8h_03}
\input{namespaceanonymous__namespace_02kruskal__test_8h_03}
\input{namespaceanonymous__namespace_02matrix__shortest__path__test_8h_03}
\input{namespaceanonymous__namespace_02matrixgraph__test_8h_03}
\input{namespaceanonymous__namespace_02minqueue__test_8h_03}
\input{namespaceanonymous__namespace_02prim__test_8h_03}
\input{namespaceanonymous__namespace_02relabeltofront__test_8h_03}
\input{namespaceanonymous__namespace_02searchtree__test_8h_03}
\input{namespaceanonymous__namespace_02strongconnectedcomponent__test_8h_03}
\input{namespaceanonymous__namespace_02topologysort__test_8h_03}
\input{namespace_introduction_to_algorithm}
\input{namespace_introduction_to_algorithm_1_1_dynamic_programming_algorithm}
\input{namespace_introduction_to_algorithm_1_1_graph_algorithm}
\input{namespace_introduction_to_algorithm_1_1_queue_algorithm}
\input{namespace_introduction_to_algorithm_1_1_select_algorithm}
\input{namespace_introduction_to_algorithm_1_1_set_algorithm}
\input{namespace_introduction_to_algorithm_1_1_sort_algorithm}
\input{namespace_introduction_to_algorithm_1_1_string_matching_algorithm}
\input{namespace_introduction_to_algorithm_1_1_tree_algorithm}
\chapter{Class Documentation}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_a_d_j_list_graph}
\input{class_bellman_ford_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_b_f_s___vertex}
\input{class_b_f_s_test}
\input{class_b_f_s_vertex_test}
\input{struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree}
\input{struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node}
\input{class_binary_tree_node_test}
\input{class_binary_tree_test}
\input{class_connected_component_test}
\input{class_dag_shortest_path_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex}
\input{class_d_f_s_test}
\input{class_d_f_s_vertex_test}
\input{class_dijkstra_test}
\input{struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node}
\input{class_disjoint_set_node_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge}
\input{class_edge_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_flow_vertex}
\input{class_floyd_warshall_test}
\input{class_ford_fulkerson_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_front_flow_vertex}
\input{class_front_flow_vertex_test}
\input{class_generic_push_relabel_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph}
\input{class_graph_a_d_j_list_test}
\input{class_graph_matrix_test}
\input{class_graph_test}
\input{class_johnson_test}
\input{class_kruskal_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_list_node}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_matrix_graph}
\input{class_matrix_shortest_path_test}
\input{class_introduction_to_algorithm_1_1_queue_algorithm_1_1_min_queue}
\input{class_min_queue_test}
\input{struct_node}
\input{class_prim_test}
\input{class_relabel_to_front_test}
\input{class_s_c_c_test}
\input{class_introduction_to_algorithm_1_1_tree_algorithm_1_1_search_tree}
\input{class_search_tree_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_set_vertex}
\input{class_set_vertex_test}
\input{class_introduction_to_algorithm_1_1_sort_algorithm_1_1_sort___heap}
\input{class_topology_sort_test}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_vertex}
\input{struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_vertex_p}
\chapter{File Documentation}
\input{longest__common__subsequence_8h}
\input{longest__common__subsequence__test_8h}
\input{floyd__warshall_8h}
\input{floyd__warshall__test_8h}
\input{johnson_8h}
\input{johnson__test_8h}
\input{matrix__shortest__path_8h}
\input{matrix__shortest__path__test_8h}
\input{connectedcomponent_8h}
\input{connectedcomponent__test_8h}
\input{bfs_8h}
\input{bfs__test_8h}
\input{dfs_8h}
\input{dfs__test_8h}
\input{adjlistgraph_8h}
\input{adjlistgraph__test_8h}
\input{graph_8h}
\input{graph__test_8h}
\input{edge_8h}
\input{edge__test_8h}
\input{bfs__vertex_8h}
\input{bfs__vertex__test_8h}
\input{dfs__vertex_8h}
\input{dfs__vertex__test_8h}
\input{flow__vertex_8h}
\input{flow__vertex__test_8h}
\input{front__flow__vertex_8h}
\input{front__flow__vertex__test_8h}
\input{set__vertex_8h}
\input{set__vertex__test_8h}
\input{vertex_8h}
\input{vertex__test_8h}
\input{vertexp_8h}
\input{vertexp__test_8h}
\input{matrixgraph_8h}
\input{matrixgraph__test_8h}
\input{strongconnectedcomponent_8h}
\input{strongconnectedcomponent__test_8h}
\input{topologysort_8h}
\input{topologysort__test_8h}
\input{fordfulkerson_8h}
\input{fordfulkerson__test_8h}
\input{genericpushrelabel_8h}
\input{genericpushrelabel__test_8h}
\input{relabeltofront_8h}
\input{relabeltofront__test_8h}
\input{kruskal_8h}
\input{kruskal__test_8h}
\input{prim_8h}
\input{prim__test_8h}
\input{bellmanford_8h}
\input{bellmanford__test_8h}
\input{dagshortpath_8h}
\input{dagshortpath__test_8h}
\input{dijkstra_8h}
\input{dijkstra__test_8h}
\input{header_8h}
\input{minqueue_8h}
\input{minqueue__test_8h}
\input{goodselect_8h}
\input{goodselect__test_8h}
\input{randomizedselect_8h}
\input{randomizedselect__test_8h}
\input{disjointset_8h}
\input{disjointset__test_8h}
\input{bucketsort_8h}
\input{bucketsort__test_8h}
\input{countsort_8h}
\input{countsort__test_8h}
\input{heapsort_8h}
\input{heapsort__test_8h}
\input{insertsort_8h}
\input{insertsort__test_8h}
\input{mergesort_8h}
\input{mergesort__test_8h}
\input{quicksort_8h}
\input{quicksort__test_8h}
\input{radixsort_8h}
\input{radixsort__test_8h}
\input{finiteautomatonmatch_8h}
\input{finiteautomatonmatch__test_8h}
\input{kmp_8h}
\input{kmp__test_8h}
\input{rabinkarpmatch_8h}
\input{rabinkarpmatch__test_8h}
\input{match_8h}
\input{match__test_8h}
\input{binarytree_8h}
\input{binarytree__test_8h}
\input{binarytreenode_8h}
\input{binarytreenode__test_8h}
\input{searchtree_8h}
\input{searchtree__test_8h}
%--- End generated contents ---

% Index
\backmatter
\newpage
\phantomsection
\clearemptydoublepage
\addcontentsline{toc}{chapter}{Index}
\printindex

\end{document}
